The clique vector c(G) of a graph G is the sequence (c(1), c(2), ..., c(d)) in N-d, where c(i) is the number of cliques in G with i vertices and d is the largest cardinality of a clique in G. In this note, we use tools from commutative algebra to characterize all possible clique vectors of k-connected chordal graphs.
展开▼
